Talk by Jerome Feldman, ICSI/Computer Science, UC Berkeley. Given to the Redwood Center for Theoretical Neuroscience at UC Berkeley.
Note: The handout for this talk is in the "All Files" section (left side of page).
The famous Neural Binding Problem (NBP) comprises at least four distinct problems with different computational and neural requirements. This talk will review the current state of work on: General Coordination, Local Feature Binding, Variable Binding, and the Subjective Unity of Perception. There is significant continuing progress, partially masked by confusing the different versions of the NBP. The talk will also include some of our recent work on Variable Binding.